Forward Analysis of Depth-Bounded Processes
نویسندگان
چکیده
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems.
منابع مشابه
On Boundedness in Depth in the π-Calculus⋆
We investigate the class PBD of π-Calculus processes that are bounded in the function depth. First, we show that boundedness in depth has an intuitive characterisation when we understand processes as graphs: a process is bounded in depth if and only if the length of the simple paths is bounded. The proof is based on a new normal form for the π-Calculus called anchored fragments. Using this conc...
متن کاملBounds on Mobility
We study natural semantic fragments of the π-calculus: depthbounded processes (there is a bound on the longest communication path), breadth-bounded processes (there is a bound on the number of parallel processes sharing a name), and name-bounded processes (there is a bound on the number of shared names). We give a complete characterization of the decidability frontier for checking if a π-calcul...
متن کاملUsing Session Types for Reasoning About Boundedness in the Pi-Calculus
The classes of depth-boundedand name-bounded processes are fragments of the π-calculus for which some of the decision problems that are undecidable for the full calculus become decidable. P is depth-bounded at level k if every reduction sequence for P contains successor processes with at most k active nested restrictions. P is name-bounded at level k if every reduction sequence for P contains s...
متن کاملA Generalized Class of Lyons-zheng Processes
Generalizing Lyons and Zheng ((13]) we study Dirichlet processes admitting a decomposition into the sum of a forward and a backward local martingale plus a bounded variation process. We develop a framework of stochastic calculus for these processes and deal with existence and uniqueness for stochastic diierential equations driven by such processes. In particular, Bessel processes turn out to be...
متن کاملNeural Network Meta-Modeling of Steam Assisted Gravity Drainage Oil Recovery Processes
Production of highly viscous tar sand bitumen using Steam Assisted Gravity Drainage (SAGD) with a pair of horizontal wells has advantages over conventional steam flooding. This paper explores the use of Artificial Neural Networks (ANNs) as an alternative to the traditional SAGD simulation approach. Feed forward, multi-layered neural network meta-models are trained through the Back-...
متن کامل